Non-Denumerable Infinitary Modal Logic

نویسنده

  • Max J. Cresswell
چکیده

Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal logic. However, the logics studied by Segerberg and Goldblatt are based on denumerable sets of pairs 〈Γ, α〉 of sets Γ of well-formed formulae and well-formed formulae α. In this paper I show how a generalisation of the infinite cut-rule used by Segerberg and Goldblatt enables the removal of the limitation to denumerable sets of sequents.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Logics with Infinitary Proof Systems

We provide a strongly complete infinitary proof system for hybrid logic. This proof system can be extended with countably many sequents. Thus, although these logics may be non-compact, strong completeness proofs are provided for infinitary hybrid versions of non-compact logics like ancestral logic and Segerberg’s modal logic with the bounded chain condition. This extends the completeness result...

متن کامل

Strong completeness for non-compact hybrid logics

We provide a strongly complete infinitary proof system for hybrid logic. This proof system can be extended with countably many sequents. Thus completeness proofs are provided for infinitary hybrid versions of non-compact logics like ancestral logic and Segerberg’s modal logic with the bounded chain condition. This extends the completeness result for hybrid logics by Blackburn and Tzakova.

متن کامل

An Infinitary Graded Modal Logic (Graded Modalities VI)

We prove a completeness theorem for K:l, the infinitary extension of the graded version K O of the minimal normal logic K , allowing conjunctions and disjunctions of countable sets of formulas. This goal is achieved using both the usual tools of the normal logics with graded modalities and the machinery of the predicate infinitary logics in a version adapted to modal logic. Mathematics Subject ...

متن کامل

Strong completeness and limited canonicity for PDL and similar modal logics

Propositional dynamic logic (PDL) is complete but not compact. As a consequence, strong completeness (the property Γ |= φ ⇒ Γ ` φ) requires an infinitary proof system. In this paper, we present a short proof for strong completeness of PDL relative an infinitary proof system containing the rule from [α;βn]φ for all n ∈ N, conclude [α;β∗]φ. The proof uses a universal canonical model, and it is ge...

متن کامل

Cut–Free Axiomatizations for Stratified Modal Fixed Point Logic

We present an infinitary and a finitary cut–free axiomatization for a fragment of the modal μ–calculus in which nesting of fixed points is restricted to non–interleaving occurrences. In this study we prove soundness and completeness of both axiomatizations. Completeness is established by constructing a canonical countermodel to any non– provable formula using an extension of the method of satur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. UCS

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2009